INFC data, waiting for a happy end
نویسندگان
چکیده
منابع مشابه
passivity in waiting for godot and endgame: a psychoanalytic reading
this study intends to investigate samuel beckett’s waiting for godot and endgame under the lacanian psychoanalysis. it begins by explaining the most important concepts of lacanian psychoanalysis. the beckettian characters are studied regarding their state of unconscious, and not the state of consciousness as is common in most beckett studies. according to lacan, language plays the sole role in ...
a new approach to credibility premium for zero-inflated poisson models for panel data
هدف اصلی از این تحقیق به دست آوردن و مقایسه حق بیمه باورمندی در مدل های شمارشی گزارش نشده برای داده های طولی می باشد. در این تحقیق حق بیمه های پبش گویی بر اساس توابع ضرر مربع خطا و نمایی محاسبه شده و با هم مقایسه می شود. تمایل به گرفتن پاداش و جایزه یکی از دلایل مهم برای گزارش ندادن تصادفات می باشد و افراد برای استفاده از تخفیف اغلب از گزارش تصادفات با هزینه پائین خودداری می کنند، در این تحقیق ...
15 صفحه اولThe Happy End Theorem and Related Results
The Erdős–Szekeres k-gon theorem [1] says that for any integer k ≥ 3 there is an integer n(k) such that any set of n(k) points in the plane, no three on a line, contains k points which are vertices of a convex k-gon. It is a classical result both in combinatorial geometry and in Ramsey theory. Sometimes it is called the Happy End(ing) Theorem (a name given by Paul Erdős), since George Szekeres ...
متن کاملA Three-Coefficient Model with Global Optimization for Heavy End Characterization of Gas Condensate PVT Data
Characterization of heavy end, as plus fraction, is among the most crucial steps in predicting phase behavior of a hydrocarbon fluid system. Proper selection of single carbon number (SCN) distribution function is essential for heavy end characterization. The SCN distribution function is subject to fluid nature. The exponential distribution function has been and is widely applied to gas condensa...
متن کاملErdös-Szekeres "happy end"-type theorems for separoïds
In 1935 Pál Erdős and György Szekeres proved that, roughly speaking, any configuration of n points in general position in the plane have log n points in convex position —which are the vertices of a convex polygon. Later, in 1983, Bernhard Korte and László Lovász generalised this result in a purely combinatorial context; the context of greedoids. In this note we give one step further to generali...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Forest@ - Rivista di Selvicoltura ed Ecologia Forestale
سال: 2009
ISSN: 1824-0119
DOI: 10.3832/efor0606-006